Weight-Quantized SqueezeNet for Resource-Constrained Robot Vacuums for Indoor Obstacle Classification
نویسندگان
چکیده
With the rapid development of artificial intelligence (AI) theory, particularly deep learning neural networks, robot vacuums equipped with AI power can automatically clean indoor floors by using intelligent programming and vacuuming services. To date, several models have been proposed to distinguish objects between cleanable litter noncleanable hazardous obstacles. Unfortunately, these existing focus entirely on accuracy enhancement object classification, little effort has made minimize memory size implementation cost models. As a result, require far more space than typical vacuum provide. address this shortcoming, paper aims study find an efficient model that achieve good balance classification usage (i.e., cost). In work, we propose weight-quantized SqueezeNet for vacuums. This classify litters from obstacles based image or video captures Furthermore, collect videos pictures captured built-in cameras use them construct diverse dataset. The dataset contains 20,000 images ground-view perspective dining rooms, kitchens living rooms various houses under different lighting conditions. Experimental results show comparable around 93% while reducing at least 22.5 times. More importantly, footprint required our is only 0.8 MB, indicating run smoothly resource-constrained vacuums, where low-end processors microcontrollers are dedicated running algorithms.
منابع مشابه
A THEORETICALLY CORRECT RESOURCE USAGE VISUALIZATION FOR THE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM
The cumulative resource constraints of the resource-constrained project scheduling problem (RCPSP) do not treat the resource demands as geometric rectangles, that is, activities are not necessarily assigned to the same resource units over their processing times. In spite of this fact, most papers on resource-constrained project scheduling mainly in the motivation phase use a strip packing of re...
متن کاملUncertain Resource Availabilities: Proactive and Reactive Procedures for Preemptive Resource Constrained project Scheduling Problem
Project scheduling is the part of project management that deals with determining when intime to start (and finish) which activities and with the allocation of scarce resources to theproject activities. In practice, virtually all project managers are confronted with resourcescarceness. In such cases, the Resource-Constrained Project Scheduling Problem (RCPSP)arises. This optimization problem has...
متن کاملAn Algorithm for Resource Allocation through the Classification of DMUs
Data envelopment analysis (DEA) is a non-parametric method for assessing relative efficiency of decision-making units (DMUs). Every single decision-maker with the use of inputs produces outputs. These decision-making units will be defined by the production possibility set. Resource allocation to DMUs is one of the concerns of managers since managers can employ the results of this process to a...
متن کاملOptimal Trajectory Planning of a Mobile Robot with Spatial Manipulator For Spatial Obstacle Avoidance
Mobile robots that consist of a mobile platform with one or many manipulators mounted on it are of great interest in a number of applications. Combination of platform and manipulator causes robot operates in extended work space. The analysis of these systems includes kinematics redundancy that makes more complicated problem. However, it gives more feasibility to robotic systems because of the e...
متن کاملRobot-Beacon Distributed Range-Only SLAM for Resource-Constrained Operation
This work deals with robot-sensor network cooperation where sensor nodes (beacons) are used as landmarks for Range-Only (RO) Simultaneous Localization and Mapping (SLAM). Most existing RO-SLAM techniques consider beacons as passive devices disregarding the sensing, computational and communication capabilities with which they are actually endowed. SLAM is a resource-demanding task. Besides the t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AI
سال: 2022
ISSN: ['2673-2688']
DOI: https://doi.org/10.3390/ai3010011